Fault Recovery Mechanisms in Utility Accrual Real Time Scheduling Algorithm
نویسندگان
چکیده
In this paper, we proposed two recovery solutions over the existing error-free utility accrual scheduling algorithm known as General Utility Accrual Scheduling algorithm (or GUS) (Peng Li, 2004). A robust fault recovery algorithm called Backward Recovery GUS (or BRGUS) works by adapting the time redundancy model i.e., by re-executing the affected task after its transient error period is over. The BRGUS is compared with a less complicated recovery algorithm named as Abortion Recovery GUS (or ARGUS) that simply aborts all faulty tasks. Our main objectives are (1) to maximize the total accrued utility and (2) to ensure correctness of the executed tasks on best effort basis and achieve the fault free tasks as much as possible. Our simulation results reveal that BRGUS outperforms the ARGUS algorithm with higher accrued utility and less abortion ratio, making it more suitable and efficient in adaptive real time system.
منابع مشابه
A discrete event simulation framework for utility accrual scheduling algorithm in uniprocessor environment
Problem statement: The heterogeneity in the choice of simulation platforms for real time scheduling stands behind the difficulty of developing a common simulation environment. A Discrete Event Simulation (DES) for a real time scheduling domain encompassing event definition, time advancing mechanism and scheduler has yet to be developed. Approach: The study focused on the proposed and the develo...
متن کاملA Discrete Event Simulation Framework for Utility Accrual Scheduling Algorithm in Uniprocessor Environment
Problem statement: The heterogeneity in the choice of simulation platforms for real time scheduling stands behind the difficulty of developing a common simulation environment. A Discrete Event Simulation (DES) for a real time scheduling domain encompassing event definition, time advancing mechanism and scheduler has yet to be developed. Approach: The study focused on the proposed and the develo...
متن کاملOn Scheduling Exception Handlers in Dynamic Real-Time Systems
We consider the problem of scheduling exception handlers in real-time systems that operate under runtime uncertainties including those on execution times, activity arrivals, and failure occurrences. The application/scheduling model includes activities and their exception handlers that are subject to time/utility function (TUF) time constraints and an utility accrual (UA) optimality criterion. A...
متن کاملOn Best-Effort Utility Accrual Real-Time Scheduling on Multiprocessors
We consider the problem of scheduling dependent real-time tasks for overloads on a multiprocessor system, yielding best-effort timing assurance. The application/scheduling model includes tasks with time/utility function time constraints, mutual exclusion constraints, and arbitrary arrival, execution-time and resource access behaviors, with the timeliness optimization objective of maximizing the...
متن کاملGarbage Collection Scheduling for Utility Accrual Real-Time Systems
Utility Accrual (UA) scheduling is a method of dynamic real-time scheduling that is designed to respond to overload conditions by producing a feasible schedule that heuristically maximizes a pre-defined metric of utility. Whereas utility accrual schedulers have traditionally focused on CPU overload, this dissertation explores memory overload conditions during which the aggregate memory demand e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer and Information Science
دوره 2 شماره
صفحات -
تاریخ انتشار 2009